A complex example of a simplifying rewrite system
Identifieur interne : 00B401 ( Main/Exploration ); précédent : 00B400; suivant : 00B402A complex example of a simplifying rewrite system
Auteurs : Hélène Touzet [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Abstract: For a string rewriting system, it is known that termination by a simplification ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simplification yield a primitive recursive bound. Furthermore, the study of the order types of simplification orderings suggests that the recursive path ordering is, in a broad sense, a maximal simplification ordering. This would imply that simplifying string rewrite systems cannot go beyond primitive recursion. Contradicting this intuition, we construct here a simplifying string rewriting system whose complexity is not primitive recursive. This leads to a new lower bound for the complexity of simplifying string rewriting systems.
Url:
DOI: 10.1007/BFb0055079
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000874
- to stream Istex, to step Curation: 000869
- to stream Istex, to step Checkpoint: 002634
- to stream Main, to step Merge: 00BB24
- to stream PascalFrancis, to step Corpus: 000B88
- to stream PascalFrancis, to step Curation: 000C86
- to stream PascalFrancis, to step Checkpoint: 000B71
- to stream Main, to step Merge: 00BB93
- to stream Main, to step Curation: 00B401
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A complex example of a simplifying rewrite system</title><author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:267599EB867028AEF667757021A8825B3E74B51B</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0055079</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-2XQ9TQ61-6/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000874</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000874</idno><idno type="wicri:Area/Istex/Curation">000869</idno><idno type="wicri:Area/Istex/Checkpoint">002634</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002634</idno><idno type="wicri:doubleKey">0302-9743:1998:Touzet H:a:complex:example</idno><idno type="wicri:Area/Main/Merge">00BB24</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:98-0465061</idno><idno type="wicri:Area/PascalFrancis/Corpus">000B88</idno><idno type="wicri:Area/PascalFrancis/Curation">000C86</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000B71</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B71</idno><idno type="wicri:doubleKey">0302-9743:1998:Touzet H:a:complex:example</idno><idno type="wicri:Area/Main/Merge">00BB93</idno><idno type="wicri:Area/Main/Curation">00B401</idno><idno type="wicri:Area/Main/Exploration">00B401</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A complex example of a simplifying rewrite system</title><author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>Loria, Université Nancy 2, DP 239, 54506, Vand∄uvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vand∄uvre-lès-Nancy</settlement></placeName><orgName type="university">Université Nancy 2</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Combinatorial optimization</term><term>Complexity class</term><term>Computer theory</term><term>Functional programming</term><term>Recursivity</term><term>Rewriting systems</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Classe complexité</term><term>Informatique théorique</term><term>Optimisation combinatoire</term><term>Programmation fonctionnelle</term><term>Récursivité</term><term>Système réécriture</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: For a string rewriting system, it is known that termination by a simplification ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simplification yield a primitive recursive bound. Furthermore, the study of the order types of simplification orderings suggests that the recursive path ordering is, in a broad sense, a maximal simplification ordering. This would imply that simplifying string rewrite systems cannot go beyond primitive recursion. Contradicting this intuition, we construct here a simplifying string rewriting system whose complexity is not primitive recursive. This leads to a new lower bound for the complexity of simplifying string rewriting systems.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Vand∄uvre-lès-Nancy</li></settlement><orgName><li>Université Nancy 2</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name></region><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B401 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B401 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:267599EB867028AEF667757021A8825B3E74B51B
|texte= A complex example of a simplifying rewrite system
}}
| This area was generated with Dilib version V0.6.33. |  |